Constrained Coolest Path Computation in Road Networks

Routing systems have become very attractive recently. They aim to help users on finding out the optimal path to their destinations regarding travel distance, travel time, and other criteria. This paper presents a distributed architecture for networking systems which proposes a new algorithm called Coolest path, which enables multi-criteria personalization based on travel distance, travel time, points of interest, and path simplicity. Furthermore, the paper proposes and solves a-autonomy, tautonomy and k-stops shortest path problems in road networks. A-autonomy algorithm provides the Coolest path considering n stops for each a distance. Tautonomy algorithm provides the Coolest path considering n stops for each t time interval. Finally, kstops algorithm provides the Coolest path considering k stops.